Classification Visualization with Shaded Similarity Matrix
نویسندگان
چکیده
Shaded similarity matrix has long been used in visual cluster analysis. This paper investigates how it can be used in classification visualization. We focus on two popular classification methods: nearest neighbor and decision tree. Ensemble classifier visualization is also presented for handling large data sets.
منابع مشابه
Concept Tree Based Clustering Visualization with Shaded Similarity Matrices
One of the problems with existing clustering methods is that the interpretation of clusters may be difficult. Two different approaches have been used to solve this problem: conceptual clustering in machine learning and clustering visualization in statistics and graphics. The purpose of this paper is to investigate the benefits of combining clustering visualization and conceptual clustering to o...
متن کاملDetection of Fake Accounts in Social Networks Based on One Class Classification
Detection of fake accounts on social networks is a challenging process. The previous methods in identification of fake accounts have not considered the strength of the users’ communications, hence reducing their efficiency. In this work, we are going to present a detection method based on the users’ similarities considering the network communications of the users. In the first step, similarity ...
متن کاملVisualizing and Classifying Odors Using a Similarity Matrix
The Lorentzian model is an analytic expression that describes the time response of electronic nose sensors. We show how this model can be utilized to calculate a normalized similarity index between any two measurements. The set of similarity indices is then used for two purposes: visualization of the data, and classification of new samples. The visualization is carried out using graph drawing t...
متن کاملNode Similarity-based Graph Clustering and Visualization
The basis of the presented methods for the visualization and clustering of graphs is a novel similarity and distance metric, and the matrix describing the similarity of the nodes in the graph. This matrix represents the type of connections between the nodes in the graph in a compact form, thus it provides a very good starting point for both the clustering and visualization algorithms. Hence vis...
متن کاملClassifying Patterns of Land Cover Using Mutual Information and Clustering
Comparison between two maps of land use/land cover (LULC) is a fundamental task in remote sensing and geospatial data analysis with application to change detection, validation of models, and accuracy assessment [1, 2]. We present a methodology of calculating a similarity measure between every pair of LULC maps in a collection in order to classify them into characteristic LULC patterns. A patter...
متن کامل